Approximation algorithms for the test cover problem

Approximation algorithms for the test cover problem

Improved Approximation Algorithms for the Partial Vertex Cover Problem

Approximation Algorithms for the Connected Sensor Cover Problem

We study the minimum connected sensor cover problem (MIN-CSC) and the budgeted connected sensor cover (Budgeted-CSC) problem, both motivated by important applications (e.g., reduce the communication cost among sensors) in wireless sensor networks. In both problems, we are given a set of sensors and a set of target points in the Euclidean plane. In MIN-CSC, our goal is to find a set of sensors o...

Branch-and-Bound Algorithms for the Test Cover Problem

In the test cover problem a set of items is given together with a collection of subsets of the items, called tests. A smallest subcollection of tests is to be selected such that for every pair of items there is a test in the selection that contains exactly one of the two items. This problem is NP-hard in general. It has important applications in biology, pharmacy, and the medical sciences, as w...

On Some Approximation Algorithms for Dense Vertex Cover Problem

In this work we study the performance of some algorithms approximating the vertex cover problem (VCP) with respect to density constraints. We consider a modiication of the algorithm of Karpinski and Zelikovsky 9] for the weighted VCP and prove a performance guarantee for this algorithm in terms of a new density parameter. Also we investigate the hardness of approximation for the VCP on everywhe...